Secrecy of Steganographic Matrix Embedding Phillip

the secure embedding scheme (see Section II), it is hard to generate a watermarked version of c which has a low correlation with k 0. An estimation attack usually yields a watermarked object that still correlates well with k 0 ; a judge will reject the accusation on such an object, as it can only originate from a malicious seller (k 0 is only available to the seller). • Finally, can attempt to cheat in step 6 by submitting the customer a wrongly encrypted watermark E K (nkw 8 k). However, this is detected by the client in step 7 by checking the integrity of the transaction number contained therein. IV. CONCLUSION In this correspondence, we proposed a buyer–seller protocol that utilizes the concepts of secure watermark embedding. In contrast to the known solutions, which use homomorphic public-key encryption on the content and impose unpractical constraints on computational resources and transmission bandwidth, our protocol is efficient due to the use of recent secure embedding algorithms. REFERENCES [1] N. Memon and P. Wang, " A buyer-seller watermarking protocol, " IEEE Trans. An anonymous buyer-seller watermarking protocol with anonymity control, " in Information Security and Cryptology, ser. Does it need trusted third party? Design of buyer-seller watermarking protocol without trusted third party, " in Proc. 1st Int. A generalization of an anonymous buyer-seller watermarking protocol and its application to mobile communications , " in Proc. 3rd Int. Workshop Digital Watermarking, ser. Lect. An efficient and anonymous buyer-seller watermarking protocol, " IEEE Trans. Abstract—Some recent information-hiding schemes are scrutinized in terms of their cryptographic secrecy. The schemes under study appeal to the so-called matrix embedding strategy, designed to optimize embedding capacity under distortion constraints, as opposed to any cryptographic measure. Nonetheless, we establish conditions under which a key equivo-cation function is optimal, and show that under reasonable key generation models, a perfect secrecy property is nearly satisfied, limited by a mutual information measure that decreases exponentially with the block length.